Iterations and Groups of Formal Transformations
نویسندگان
چکیده
In this paper, we consider the problem of formal iteration. We construct an area preserving mapping which does not have any square root. This leads to a counterexample Moser’s existence theorem for interpolation problem. give examples transformation groups such that iteration has solution every element
منابع مشابه
Roots, iterations and logarithms of formal automorphisms
In this paper it is proved that having a logarithm is e1uivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups, too. INTRODUCTION The question whether an automorphism of a complex formal power series ring has an iteration, or may be embedded in a one parameter group has received much attention lately. The original sett...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولTemplate iterations and maximal cofinitary groups
In [2], Jörg Brendle used Hechler’s forcing notion for adding a maximal almost family along an appropriate template forcing construction to show that a (the minimal size of a maximal almost disjoint family) can be of countable cofinality. The main result of the present paper is that ag, the minimal size of maximal cofinitary group, can be of countable cofinality. To prove this we define a natur...
متن کاملFormal Methods of Transformations
The goal of this Dagstuhl seminar was to gather researchers working on the theory and practice of transformations (also know as transductions) of word and tree structures, which are realised by transducers (automata with outputs). This seminar was motivated by recent advances and breakthrough results, both in the settings of words and trees. Seminar April 2–5, 2017 – http://www.dagstuhl.de/1714...
متن کاملGeneralized Napoleon and Torricelli Transformations and Their Iterations
For given triangles T = (A,B,C) and D = (X, Y, Z), the D-Napoleon and D-Torricelli triangles ND(T ) and TD(T ) of a triangle T = (A,B,C) are the triangles A′B′C ′ and A∗B∗C∗, where ABC ′, BCA′, CAB′, A∗BC, AB∗C, ABC∗ are similar to D. In this paper it is shown that the iteration N n D(T ) either terminates or converges (in shape) to an equilateral triangle, and that the iteration T n D (T ) eit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Siberian Federal University. Mathematics and Physics
سال: 2021
ISSN: ['1997-1397', '2313-6022']
DOI: https://doi.org/10.17516/1997-1397-2021-14-5-584-588